Specification of morphological models with L-systems and relational growth grammars

نویسنده

  • Winfried Kurth
چکیده

Among the techniques for the creation of photorealistic virtual organisms, particularly plants, and in scientific models of vegetation structure, rule-based specifications (formal grammars) play a prominent role. Lindenmayer systems (L-systems) are the most widespread formalism of this sort, but certain types of graph grammars, combined with standard object-oriented programming, offer even more possibilities to specify ruledriven developments of 3-dimensional arrangements, morphology of virtual organisms and underlying processes like, e.g., metabolic reactions. Examples of grammar rules and the virtual geometrical structures generated from them, all realizable with the open-source software GroIMP (www.grogra.de), are shown. This grammar-based approach is often not directly used for the specification of a picture as a pattern of graphical elements in a plane, but for virtual 3-dimensional scenes, which are then rendered visible using standard techniques of geometry-based computer graphics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representation of Genotype and Phenotype in a Coherent Framework Based on Extended L-Systems

A formal language approach for the specification of ALife models is presented. “Relational Growth Grammars” incorporate rulebased, procedural and object-oriented concepts. By enabling parametric Lindenmayer systems to rewrite multiscaled graphs, it becomes possible to represent genes, plant organs and populations as well as developmental aspects of these entities in a common formal framework. G...

متن کامل

Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic

In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued)  regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...

متن کامل

Rule-based modelling with the XL/GroIMP software

In this software demonstration, the concept of “Relational Growth Grammars” will be illustrated in its concrete implementation, namely the high-level language XL which combines the rule-based programming paradigm of graph grammars and L-systems with the imperative and object-oriented programming paradigm of Java. The suitability of XL as a description language of rule-based ALife models will be...

متن کامل

Sensitive Growth Grammars Specifying Models of Forest Structure,

Sensitive growth grammars are systems of rewriting rules (extended Lindenmayer systems) with graphical interpretation and with "sensitive functions" designed to allow a feedback from the created virtual 3-D structures to the subsequent rule-application process. Thus it is possible to combine morphological (genetically fixed) growth rules with environmental impact and with functions depending on...

متن کامل

Extending the Use of Adaptor Grammars for Unsupervised Morphological Segmentation of Unseen Languages

We investigate using Adaptor Grammars for unsupervised morphological segmentation. Using six development languages, we investigate in detail different grammars, the use of morphological knowledge from outside sources, and the use of a cascaded architecture. Using cross-validation on our development languages, we propose a system which is language-independent. We show that it outperforms two sta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007